Goto

Collaborating Authors

 exact recovery



Exact recovery and Bregman hard clustering of node-attributed Stochastic Block Model

Neural Information Processing Systems

However, in many scenarios, nodes also have attributes that are correlated with the clustering structure. Thus, network information (edges) and node information (attributes) can be jointly leveraged to design high-performance clustering algorithms. Under a general model for the network and node attributes, this work establishes an information-theoretic criterion for the exact recovery of community labels and characterizes a phase transition determined by the Chernoff-Hellinger divergence of the model.






CorrelatedStochasticBlockModels: ExactGraphMatching withApplicationstoRecoveringCommunities

Neural Information Processing Systems

Wederivethe precise information-theoretic threshold for exact recovery: above the threshold there exists an estimator that outputs the true correspondence with probability close to1,while belowitnoestimator canrecoverthetrue correspondence with probabilityboundedawayfrom0.




Exact Recovery in the Data Block Model

Asadi, Amir R., Davoodi, Akbar, Javadi, Ramin, Parvaresh, Farzad

arXiv.org Machine Learning

Community detection in networks is a fundamental problem in machine learning and statistical inference, with applications in social networks, biological systems, and communication networks. The stochastic block model (SBM) serves as a canonical framework for studying community structure, and exact recovery, identifying the true communities with high probability, is a central theoretical question. While classical results characterize the phase transition for exact recovery based solely on graph connectivity, many real-world networks contain additional data, such as node attributes or labels. In this work, we study exact recovery in the Data Block Model (DBM), an SBM augmented with node-associated data, as formalized by Asadi, Abbe, and Verdú (2017). We introduce the Chernoff--TV divergence and use it to characterize a sharp exact recovery threshold for the DBM. We further provide an efficient algorithm that achieves this threshold, along with a matching converse result showing impossibility below the threshold. Finally, simulations validate our findings and demonstrate the benefits of incorporating vertex data as side information in community detection.